Content Delivery Latency of Caching Strategies for Information-Centric IoT

In-network caching is a central aspect of Information-Centric Networking (ICN). It enables the rapid distribution of content across the network, alleviating strain on content producers and reducing content delivery latencies. ICN has emerged as a promising candidate for use in the Internet of Things (IoT). However, IoT devices operate under severe constraints, most notably limited memory. This means that nodes cannot indiscriminately cache all content; instead, there is a need for a caching strategy that decides what content to cache. Furthermore, many applications in the IoT space are timesensitive; therefore, finding a caching strategy that minimises the latency between content request and delivery is desirable. In this paper, we evaluate a number of ICN caching strategies in regards to latency and hop count reduction using IoT devices in a physical testbed. We find that the topology of the network, and thus the routing algorithm used to generate forwarding information, has a significant impact on the performance of a given caching strategy. To the best of our knowledge, this is the first study that focuses on latency effects in ICN-IoT caching while using real IoT hardware, and the first to explicitly discuss the link between routing algorithm, network topology, and caching effects.Comment: 10 pages, 9 figures, journal pape

ENERGY-NEUTRAL DATA DELIVERY IN ENVIRONMENTALLY-POWERED WIRELESS SENSOR NETWORKS

Ph.DDOCTOR OF PHILOSOPH

GTA-m: Greedy Trajectory-Aware (m copies) routing for airborne networks

orne networks have potential applications in both civilian and military domains -- such as passenger in-flight Internet connectivity, air traffic control and in intelligence, surveillance and reconnaissance (ISR) activities. However, airborne networks suffer from frequent disruptions due to high node mobility, ad hoc connectivity and line-of-sight blockages. These challenges can be alleviated through the use of disruption-tolerant networking (DTN) techniques. In this paper, we propose GTA-m, a multi-copy greedy trajectory-aware routing protocol for airborne networks. GTA-m employs DTN capabilities and exploits the use of flight information to forwarded bundles \\emph{greedily} to intended destination(s). To alleviate the local minima issues that are inherent in greedy algorithms, GTA-m allows $m \\geq 1$ copies of each bundle to be replicated throughout the entire network. We study the performance of GTA-m by simulating flights with varying numbers of aircraft and ground stations. Through simulations in OPNET, we show that GTA-m improves the average bundle delay by 34\\% and 52\\% as compared to conventional DTN routing protocols such as Spray-and-Wait and Epidemic respectively